Labelled Propositional Modal Logics :
نویسنده
چکیده
We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and well-known class of propositional modal logics (including K, D, T, B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base logic and a labelling algebra, which interact through a xed interface. While the base logic stays xed, diierent modal logics are generated by plugging in appropriate algebras. This leads to a hierarchical structuring of modal logics with inheritance of theorems. Moreover, it allows modular correctness proofs, both with respect to soundness and completeness for semantics, and faithfulness and adequacy of the implementation. We also investigate the tradeoos in possible labelled presentations: we show that a narrow interface between the base logic and the labelling algebra supports modularity and provides an attractive proof-theory but limits the degree to which we can make use of extensions to the labelling algebra.
منابع مشابه
Free Variable Tableaux for Propositional Modal Logics Universit at Karlsruhe Fakult at F Ur Informatik Free Variable Tableaux for Propositional Modal Logics
We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain \free" and \universal" variables. Our \lean" Prolog implementation is not only surprisingly short, but compares favourably with other considerably more complex implementations for modal deduction.
متن کاملLabelled Propositional Modal Logics: Theory and Practice
We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and well-known class of propositional modal logics (including K, D, T, B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base logic and a labelling algebra, which interact through a xed interface. While the base logic stays xe...
متن کاملFree Variable
We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain \free" and \universal" variables. Our \lean" Prolog implementation is not only surprisingly short, but compares favourably with other considerably more complex implementations for modal deduction.
متن کاملProof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-free labelled sequent calculus for bi-intuitionistic propositional logic, BiInt, following S. Negri’s general method for devising sequent calculi for normal modal logics. Although it arises as a natural formalization of the Krip...
متن کاملEmbedding formalisms: hypersequents and two-level systems of rule
A system of rules consists of (possibly labelled) sequent rules connected to each other by some variables and subject to the condition of appearing in a certain order in the derivation. The formalism of systems of rules is quite powerful and allows, e.g., the definition of analytic labelled sequent calculi for intermediate and modal logics characterised by frame conditions beyond the geometric ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997